Rule learning: Ordinal prediction based on rough sets and soft-computing
نویسندگان
چکیده
This work promotes a novel point of view in rough set applications: rough sets rule learning for ordinal prediction is based on rough graphical representation of the rules. Our approach tackles two barriers of rule learning. Unlike in typical rule learning, we construct ordinal prediction with a mathematical approach, rough sets, rather than purely rule quality measures. This construction results in few but significant rules. Moreover, the rules are given in terms of ordinal predictions rather than as unique values. This study also focuses on advancing rough sets theory in favor of soft-computing. Both theoretical and a designed architecture are presented. The features of our proposed approach are illustrated using an experiment in survival analysis. A case study has been performed on melanoma data. The results demonstrate that this innovative system provides an improvement of rule learning both in computing performance for finding the rules and the usefulness of the derived rules. © 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
Title: Soft Computing Based Rule Extraction Frameworks
The rule extraction techniques have been widely developed and used for data mining in many application areas [1], such as medical diagnosis, decision-making, classification and prediction. Rough sets theory, proposed by Zdzislaw Pawlak in the early 1980’s [2], has been used as rule extraction method for machine learning, knowledge discovery, expert systems [3]. This technique has offered useful...
متن کاملLearning Rule Ensembles for Ordinal Classification with Monotonicity Constraints
Ordinal classification problems with monotonicity constraints (also referred to as multicriteria classification problems) often appear in real-life applications, however, they are considered relatively less frequently in theoretical studies than regular classification problems. We introduce a rule induction algorithm based on the statistical learning approach that is tailored for this type of p...
متن کاملExtended Probabilistic Rough Sets Under a Strict Dominance Relation
In order to handle inconsistencies in ordinal and monotonic information systems, the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) has been proposed and successfully applied in real decision making. However, there exists an error spread of inconsistencies in VC-DRSA. In this paper, we firstly induce a strict-dominance relation into Variable-Precision Rough Sets (VPRS). Two n...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملEvolutionary Fuzzy Rules for Ordinal Binary Classification with Monotonicity Constraints
We present an approach to learn fuzzy binary decision rules from ordinal temporal data where the task is to classify every instance at each point in time. We assume that one class is preferred to the other, e.g. the undesirable class must not be misclassified. Hence it is appealing to use the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) to exploit preference information abo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006